Solving a new bi-objective multi-echelon supply chain problem with a Jackson open-network issue under uncertainty
نویسندگان
چکیده
In today’s world, changes in the economic and industrial sectors are taking place more quickly than past. Based on competitive market, considering needs desires of customer is very important. Thus, designing supply chain network to minimize costs improve system efficiency, service facility, attention timely delivery should be considered. Also, deployment determine number position facilities regarded as another strategic issue. Therefore, become closer real-world application, by Jackson model (queuing theory), present study aims design a closed-loop reduce waiting time queue. Two objectives, namely minimizing cost incurred queues formed producers distributors, investigated. Queuing mathematical expressions used both dealing with objectives constraints. To develop model, which close real uncertainty, parameters, including demand rate shipping products, were considered trapezoidal fuzzy number. we crisp this uncertainty using Jimenez chance-constrained programming approaches. Due suggested model’s complexity nonlinearity, linearized much possible, then two meta-heuristic algorithms, multi-objective particle swarm optimization non-dominated sorted genetic algorithm (NSGA-II), solve model. First, structural parameters these algorithms tuned Taguchi method. Then, numerous numerical test problems ranging from small large scales compare Pareto front measuring indexes various hypothesis tests.
منابع مشابه
Optimizing Bi-Objective Multi-Commodity Tri-Echelon Supply Chain Network
The competitive market and declined economy have increased the relevant importance of making supply chain network efficient. This has created many motivations to reduce the cost of services, and simultaneously, to increase the quality of them. The network as a tri-echelon one consists of Suppliers, Warehouses or Distribution Centers (DCs), and Retailer nodes. To bring the problem closer to real...
متن کاملSolving a Bi-Objective Multi-Product Vehicle Routing Problem with Heterogeneous Fleets under an Uncertainty Condition
This paper presents a novel bi-objective multi-product capacitated vehicle routing problem with uncertainty in demand of retailers and volume of products (UCVRP) and heterogeneous vehicle fleets. The first of two conflict fuzzy objective functions is to minimize the cost of the used vehicles, fuel consumption for full loaded vehicles and shortage of products. The second ...
متن کاملA Three-Echelon Multi-Objective Multi-Period Multi-Product Supply Chain Network Design Problem: A Goal Programming Approach
In this paper, a multi-objective multi-period multi-product supply chain network design problem is introduced. This problem is modeled using a multi-objective mixed integer mathematical programming. The objectives are maximizing the total profit of logistics, maximizing service level, and minimizing inconsistency of operations. Several sets of constraints are considered to handle the real situa...
متن کاملMulti-Objective Optimization for Multi-Product Multi-Period Four Echelon Supply Chain Problems Under Uncertainty
The multi-objective optimization for a multi-product multi-period four-echelon supply chain network consisting of manufacturing plants, distribution centers (DCs) and retailers each with uncertain services and uncertain customer nodes are aimed in this paper. The two objectives are minimization of the total supply chain cost and maximization of the average number of products dispatched to custo...
متن کاملOptimizing a bi-objective multi-product multi-period three echelon supply chain network with warehouse reliability
Bi-objective optimization of a multi-product multi-period three-echelon supply chain network consisting of manufacturing plants, distribution centers (DCs) each with uncertain services, and customer nodes is aimed in this paper. The two objectives are minimization of the total cost while maximizing the average number of products dispatched to customers. The decision variables are: (1) the numbe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Soft Computing
سال: 2021
ISSN: ['1433-7479', '1432-7643']
DOI: https://doi.org/10.1007/s00500-021-06309-9